Scheduling sports competitions at multiple venues - Revisited

Applying Heuristic Methods to Schedule Sports Competitions on Multiple Venues Extended Abstract

Scheduling sports competitions is often a difficult task because it is usually very difficult to construct schedules that are considered to be fair by all competitors. In addition, the schedules normally need to satisfy a considerably large number of additional requirements and constraints. Most of the sports scheduling problems that have been tackled in the literature refer to competitions in ...

Applying Heuristic Methods to Schedule Sports Competitions on Multiple Venues

Scheduling sports competitions is a difficult task because it is often very difficult to construct schedules that are considered fair by all competitors. In addition, the schedules should also satisfy a considerably large number of additional requirements and constraints. Most of the sports scheduling problems that have been tackled in the literature refer to competitions in which a venue is as...

A constraint programming approach to the multiple-venue, sport-scheduling problem

In this paper, we consider the problem of scheduling sports competitions over several venues which are not associatedwith any of the competitors.A two-phase, constraint programming approach is developed, first identifying a solution that designates the participants and schedules each of the competitions, then assigning each competitor as the “home” or the “away” team. Computational experiments ...

Construction of sports schedules with multiple venues

A graph theoretical model is presented for constructing calendars for sports leagues where balancing requirement have to be considered with respect to the different venues where competitions are to be located. An inductive construction is given for leagues having a number of teams 2n which is of the form 2p in particular. © 2005 Elsevier B.V. All rights reserved.

Integer Programming and Simulated Annealing for Scheduling Sports Competition on Multiple Venues